Querying Relational Concept Lattices
نویسندگان
چکیده
Navigating a Concept Lattice Family w.r.t a Query Introduction Relational Concept Analysis (RCA) constructs conceptual abstractions from a relational context family (RCF). An RCF is sets of objects described by both own properties and inter-object links. It generates several lattices that are connected via relational attributes. Navigating such interrelated lattice family in order to find concepts of interest is not a trivial task due to the potentially large size of the lattices and the need to move the expert's focus from one lattice to another. We propose a query-based navigation approach that helps an expert to explore a concept lattice family, according to a navigation schema. 1 1 2 3 3
منابع مشابه
Algebraic operators for querying pattern bases
The objectives of this research work which is intimately related to pattern discovery and management are threefold: (i) handle the problem of pattern manipulation by defining operations on patterns, (ii) study the problem of enriching and updating a pattern set (e.g., concepts, rules) when changes occur in the user’s needs and the input data (e.g., object/attribute insertion or elimination, tax...
متن کاملRelational Lattices
Relational lattices are obtained by interpreting lattice connectives as natural join and inner union between database relations. Our study of their equational theory reveals that the variety generated by relational lattices has not been discussed in the existing literature. Furthermore, we show that addition of just the header constant to the lattice signature leads to undecidability of the qua...
متن کاملApplications of Ordinal Ranks to Flexible Query Answering
Exact querying and retrieving relevant data from a database is a difficult task. We present an approach for flexibly answering algebraic queries using an extension of Codd’s relational model with ordinal ranks based on residuated lattices and similarities on attribute domains.
متن کاملComputation of Cut Completions and Concept Lattices Using Relational Algebra and RelView
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices. It is shown how the algorithms can be translated into the programming language of RelView and executed using this system. Furthermore, it is demonstrated how to obtain and draw Hasse diagrams of concept lattices as l...
متن کاملRelational lattices: From databases to universal algebra
Relational lattices are obtained by interpreting lattice connectives as natural join and inner union between database relations. Our study of their equational theory reveals that the variety generated by relational lattices has not been discussed in the existing literature. Furthermore, we show that addition of just the header constant to the lattice signature leads to undecidability of the qua...
متن کامل